首页> 外文OA文献 >Benders Decomposition for the Design of a Hub and Shuttle Public Transit System
【2h】

Benders Decomposition for the Design of a Hub and Shuttle Public Transit System

机译:Benders分解设计枢纽和穿梭公共交通   系统

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

The BusPlus project aims at improving the off-peak hours public transitservice in Canberra, Australia. To address the difficulty of covering a largegeographic area, BusPlus proposes a hub and shuttle model consisting of acombination of a few high-frequency bus routes between key hubs and a largenumber of shuttles that bring passengers from their origin to the closest huband take them from their last bus stop to their destination. This paper focuseson the design of bus network and proposes an efficient solving method to thismultimodal network design problem based on the Benders decomposition method.Starting from a MIP formulation of the problem, the paper presents a Bendersdecomposition approach using dedicated solution techniques for solvingindependent sub-problems, Pareto optimal cuts, cut bundling, and core pointupdate. Computational results on real-world data from Canberra's public transitsystem justify the design choices and show that the approach outperforms theMIP formulation by two orders of magnitude. Moreover, the results show that thehub and shuttle model may decrease transit time by a factor of 2, while stayingwithin the costs of the existing transit system.
机译:BusPlus项目旨在改善澳大利亚堪培拉的非高峰时间公共交通服务。为了解决覆盖较大地理区域的困难,BusPlus提出了一种集线器和班车的模型,该模型由关键集线器之间的一些高频巴士路线和大量将乘客从其出发地带到最近的集线器并从他们的集线器中带走的班车组成最后一个巴士站到他们的目的地。本文着重于总线网络的设计,并基于Benders分解方法,提出了一种有效的多模态网络设计问题的求解方法。从问题的MIP公式出发,提出了一种采用专用求解技术求解独立子问题的Benders分解方法。 ,帕累托最优切割,切割捆绑和核心点更新。来自堪培拉公共交通系统的真实世界数据的计算结果证明了设计选择的合理性,并表明该方法比MIP公式的性能高两个数量级。此外,结果表明,枢纽和航天飞机模型可以将运输时间减少2倍,而不会超出现有运输系统的成本。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号